منابع مشابه
Are Constants Constant?
The prospect of a time-dependent Higgs vacuum expectation value is examined within the standard model of electroweak interactions. It is shown that the classical equation of motion for the Higgs field admits a solution that is a doubly-periodic function of time. The corresponding Dirac equation for the electron field is equivalent to a second order differential equation with doubly-periodic coe...
متن کاملPERSPECTIVES Are rate constants constant?
2006;571;502-; originally published online Feb 2, 2006; J. Physiol. Stephen W. Jones Are rate constants constant? This information is current as of March 21, 2006 publication unless article is open access. This version of the article may not be posted on a public website for 12 months after http://jp.physoc.org/cgi/content/full/571/3/502 This is the final published version of this article; it i...
متن کاملB Constant Propagation : Simple Constants 25
Since decades, basic-block (BB) graphs are the state-of-the-art means for representing programs in advanced industrial compiler environments. The usual justi cation for introducing the intermediate BB-structures in the program representation is performance: analyses on BB-graphs are generally assumed to outperform their counterparts on single-instruction (SI ) graphs, which, undoubtedly, are co...
متن کاملPolynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that polynomial constants are decidable in non-deterministic flow graphs. In polynomial constant propagation, assignment state...
متن کاملAsymptotically the List Colouring Constants Are 1
In this paper we prove the following result about vertex list colourings, which shows that a conjecture of the first author (1999, J. Graph Theory 31, 149–153) is asymptotically correct. Let G be a graph with the sets of lists SðvÞ; satisfying that for every vertex jSðvÞj 1⁄4 ð1þ oð1ÞÞd and for each colour c 2 SðvÞ; the number of neighbours of v that have c in their list is at most d : Then the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Polylinguality and Transcultural Practices
سال: 2019
ISSN: 2618-8988,2618-897X
DOI: 10.22363/2618-897x-2019-16-3-375-397